binary search

двоичный поиск, дихотомический поиск, поиск методом дитохомизации


Англо-русский словарь по робототехнике. 2013.

Смотреть что такое "binary search" в других словарях:

  • Binary Search —   [dt. binäre Suche], Suchalgorithmen …   Universal-Lexikon

  • binary search — dvejetainė paieška statusas T sritis automatika atitikmenys: angl. binary search; dichotomizing search vok. binäres Suchen, n; dichotomische Suche, f; eliminierende Suche, f rus. двоичный поиск, m; дихотомический поиск, m pranc. recherche binaire …   Automatikos terminų žodynas

  • binary search — dvejetainė paieška statusas T sritis informatika apibrėžtis Paieškos algoritmas, kai elemento ieškoma surikiuotame sąraše jį dalijant pusiau. Pirmiausia palyginamas ieškomas elementas su elementu, esančiu sąrašo viduryje. Jeigu jie sutampa,… …   Enciklopedinis kompiuterijos žodynas

  • binary search — search by reducing the search parameters by half during each cycle …   English contemporary dictionary

  • Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… …   Wikipedia

  • Binary search algorithm — for performing binary searches on Java arrays and Lists, respectively. They must be arrays of primitives, or the arrays or Lists must be of a type that implements the Comparable interface, or you must specify a custom Comparator object. Microsoft …   Wikipedia

  • Self-balancing binary search tree — In computer science, a self balancing binary search tree or height balanced binary search tree is a binary search tree that attempts to keep its height , or the number of levels of nodes beneath the root, as small as possible at all times,… …   Wikipedia

  • Randomized binary search tree — A randomized binary search tree (abbreviated RBST, also known as Cartesian tree) is a type of binary search tree, with data nodes organizedas in a normal binary search tree. Each node has also an access priority, namely p(n) which is chosen in a… …   Wikipedia

  • Uniform binary search — is an optimization of the classic binary search algorithm invented by Donald Knuth and given in Knuth s The Art of Computer Programming . It uses a lookup table to update a single array index, rather than taking the midpoint of an upper and a… …   Wikipedia

  • Binary Tree Sort — (im Deutschen auch Binarytreesort) ist ein einfacher, nicht stabiler Sortieralgorithmus. Inhaltsverzeichnis 1 Prinzip 2 Komplexität 3 Vor und Nachteile 4 Implementierungen …   Deutsch Wikipedia

  • Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… …   Wikipedia

Книги

Другие книги по запросу «binary search» >>

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.